Using First-Order Logic to Reason about Submodule Construction

نویسنده

  • Gregor von Bochmann
چکیده

We consider the following problem: For a system consisting of two components, the behavior of one component is known as well as the desired global behavior. What should be the behavior of the second component such that the behavior of the composition of the two conforms to the desired behavior ? This problem has been called "submodule construction" or "equation solving”. Solutions to this problem have been described in the context of various specification formalisms and various conformance relations. This paper presents a new formulation of this problem and its solution in first-order logic. It is also shown how the solutions for submodule construction in various specification formalisms can be derived from the solution in logic. The simple proof of correctness for the logic solution is then used to justify the particular forms of solutions in the different specification formalisms, such as (a) synchronous rendezvous at several interfaces, and (b) interleaved rendezvous (labeled transition systems).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using First-Order Logic to Reason about Submodule Construction1

We consider the following problem: For a system consisting of two components, the behavior of one component is known as well as the desired global behavior. What should be the behavior of the second component such that the behavior of the composition of the two conforms to the desired behavior ? This problem has been called "submodule construction" or "equation solving"; and in the context of s...

متن کامل

Using logic to solve the submodule construction problem

Submodule construction is the problem of finding a new submodule which, together with a given submodule, provides a behavior that conforms to a given desired global behavior. A new formulation of this problem and its solution in first-order logic is presented, and it is shown how the known solutions to this problem in the context of various communication paradigms and specification formalisms c...

متن کامل

Coalescing: Syntactic Abstraction for Reasoning in First-Order Modal Logics

We present a syntactic abstraction method to reason about first-order modal logics by using theorem provers for standard first-order logic and for propositional modal logic.

متن کامل

Submodule Construction for Extended State Machine Models

In this paper, we consider the problem of extending existing submodule construction techniques that have been developed for finite state models into more expressive and compact behavioral models that handle data through parameterized interactions, state variables and simple guards. We provide a behavioral model based on extended Input-Output Automata and describe an algorithm that provides the ...

متن کامل

Belief Revision: A Computational Approach

In order to reason about the real world, intelligent systems must have ways of dealing with incomplete and inconsistent information. This issue is addressed in the study of nonmonotonic reasoning, truth maintenance and database update. Belief revision is a formal approach which is central to these areas. This thesis describes a computational approach to the logic of belief revision developed by...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009